Going Bunkers: The Joint Route Selection and Refueling Problem
نویسندگان
چکیده
Managing shipping vessel profitability is a central problem in marine transportation. We consider two commonly used types of vessels—“liners” (ships whose routes are fixed in advance) and “trampers” (ships for which future route components are selected based on available shipping jobs)—and formulate a vessel profit maximization problem as a stochastic dynamic program. For liner vessels, the profit maximization reduces to the problem of minimizing refueling costs over a given route subject to random fuel prices and limited vessel fuel capacity. Under mild assumptions about the stochastic dynamics of fuel prices at different ports, we provide a characterization of the structural properties of the optimal liner refueling policies. For trampers, the vessel profit maximization combines refueling decisions and route selection, which adds a combinatorial aspect to the problem. We characterize the optimal policy in special cases where prices are constant through time and do not differ across ports and prices are constant through time and differ across ports. The structure of the optimal policy in such special cases yields insights on the complexity of the problem and also guides the construction of heuristics for the general problem setting.
منابع مشابه
Refueling problem of alternative fuel vehicles under intuitionistic fuzzy refueling waiting times: a fuzzy approach
Using alternative fuel vehicles is one of the ways to reduce the consumption of fossil fuels which have many negative environmental effects. An alternative fuel vehicle needs special planning for its refueling operations because of some reasons, e.g. limited number of refueling stations, uncertain refueling queue times in the stations, variable alternative fuel prices among the stations, etc. I...
متن کاملA linear-time algorithm for finding optimal vehicle refueling policies
We explore a fixed-route vehicle refueling problem as a special case of the inventorycapacitated lot-sizing problem, and present a linear-time greedy algorithm for finding optimal refueling policies.
متن کاملDSS of vehicle refueling: A new enhanced approach with fuel weight considerations
a r t i c l e i n f o The fixed-route vehicle-refueling problem (FRVRP) is a mathematical problem widely used in the U.S. trucking industry. The FRVRP seeks the best refueling policy (sequence of fuel stations to use, along with the fueling quantity at each station) for a given (fixed) origin–destination route that minimizes a vehicle's refueling cost. While effective, the current FRVRP methods...
متن کاملThe Aircraft Routing with Air Refueling Problem: Exact and Greedy Approaches
We consider the problem of finding the least cost route for an aircraft between a predetermined starting and target location while ensuring either enough fuel is on board or acquired en route via refueling for completion of the route. Other considerations of this problem include adherence to regulations for threat and no-fly zones and to regulations for the minimum fuel needed on an aircraft in...
متن کاملAn Exact Algorithm for a Fuel-Constrained Autonomous Vehicle Path Planning Problem
This paper addresses a fuel-constrained, autonomous vehicle path planning problem in the presence of multiple refueling stations. We are given a set of targets, a set of refueling stations, and a depot where m vehicles are stationed. The vehicles are allowed to refuel at any refueling station, and the objective of the problem is to determine a route for each vehicle starting and terminating at ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Manufacturing & Service Operations Management
دوره 11 شماره
صفحات -
تاریخ انتشار 2009